منابع مشابه
A Stackelberg Game Theory Approach
In the Long Term Evolution-Advanced (LTE-A) system, Device-to-device (D2D) communication underlying cellular networks can bring some advantages such as high data rates, low delay, low power consumption by reusing frequency bands with cellular user equipments (UEs). While at the same time, inter-cell and intra-cell interference is inevitable. The D2D users and cellular UEs will compete or cooper...
متن کاملStackelberg Shortest Path Tree Game, Revisited
Let G(V,E) be a directed graph with n vertices and m edges. The edges E of G are divided into two types: EF and EP . Each edge of EF has a fixed price. The edges of EP are the priceable edges and their price is not fixed a priori. Let r be a vertex of G. For an assignment of prices to the edges of EP , the revenue is given by the following procedure: select a shortest path tree T from r with re...
متن کاملRobust Stackelberg game in communication systems
This paper studies multi-user communication systems with two groups of users: leaders which possess system information, and followers which have no system information using the formulation of Stackelberg games. In such games, the leaders play and choose their actions based on their information about the system and the followers choose their actions myopically according to their observations of ...
متن کاملOn a Stackelberg Subset Sum Game
This contribution deals with a two-level discrete decision problem, a so-called Stackelberg strategic game: A Subset Sum setting is addressed with a set $N$ of items with given integer weights. One distinguished player, the leader, may alter the weights of the items in a given subset $L\subset N$, and a second player, the follower, selects a solution $A\subseteq N$ in order to utilize a bounded...
متن کاملSpecializations and Generalizations of the Stackelberg Minimum Spanning Tree Game
Let be given a graph G = (V,E) whose edge set is partitioned into a set R of red edges and a set B of blue edges, and assume that red edges are weighted and form a spanning tree of G. Then, the Stackelberg Minimum Spanning Tree (StackMST) problem is that of pricing (i.e., weighting) the blue edges in such a way that the total weight of the blue edges selected in a minimum spanning tree of the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2003
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(03)90130-1